clipping algorithm
英 [ˈklɪpɪŋ ˈælɡərɪðəm]
美 [ˈklɪpɪŋ ˈælɡərɪðəm]
网络 裁剪算法
双语例句
- Because clipping is one of basis algorithms in computer graphics, it is necessary to find out a high-efficiency clipping algorithm based on ellipse window.
现有的椭圆窗口裁剪算法需通过求交运算确定裁剪对象，算法复杂，而且只适用于简单图形的裁剪。 - A 2-D line clipping algorithm with the least arithmetic operations
具有最少算术运算量的二维线裁剪算法 - Line clipping algorithm based on a circular window is proposed in this paper.
提出了一种具有普遍适用意义的圆形窗口的直线段裁剪算法。 - An efficient clipping algorithm of urban massive 3D scene
城市海量三维场景的高效裁剪算法研究 - A clipping algorithm of straight line based on circular window;
提出一种图形及椭圆形窗口的裁剪算法。 - An efficient cylindrical clipping algorithm is presented to rapidly drill holes in polyhedrons, which are made up of convex polygons.
提出一种高效的对凸多边形组成的多面体进行圆柱面裁剪的算法，并实现了多面体的快速钻孔。 - Parabola Clipping Algorithm Based on N-Steps Rendering Theory
基于多步法绘制理论的抛物线裁剪算法 - A new segments clipping algorithm against circle window in2D space and3D eyecooldinate system is presented.
给出了一种在2维空间和3维观察坐标系下直线段在圆形窗口下的裁剪新算法。 - Line Clipping Algorithm Against A Polygon Based on Point Region Distributing
基于点区域分布的多边形窗口线裁剪算法 - Since graphics clipping and region filling are needed in the chart display, the graphics clipping algorithm and region filling algorithm are designed according to the requirement of the chart display.
闭于比现无算法，依据海图现示的须要，设计实现了海图现示外的图形剪裁和区域挖充算法。 - At first, present a curve clipping algorithm.
第三章裁剪，对于矩形裁剪窗口，首先提出了一个思想简单的曲线裁剪算法； - A Clipping Algorithm of Convex Polygons
关于凸多边形的修剪算法研究 - Region can be presented by directed rings based on quadratic B-spline curves. This clipping algorithm is presented through the construction of a list of points of intersection between the rings.
通过以二次B样条曲线为基础的有向环来表示区域，并构造环之间的交点表等给出了一般二次曲线窗口上的裁剪算法。 - Next, put forward a line clipping algorithm against a general polygon.
然后提出了一个任意多边形窗口（包括凹多边形窗口）的线裁剪算法； - A High Efficient Polygon Clipping Algorithm Against Rectangular Window Based on Encoding and Classification Technique
基于编码与分类技术的任意多边形裁剪新算法 - A Clipping Algorithm for Rectangular Windows Based on Line Segment Intersection
基于线段与线段求交的矩形窗口裁剪算法 - We analyzed the line clipping against a circular window with a hole in detail, and presented a new line clipping algorithm.
详尽地分析了带孔的圆形窗口上的直线裁剪问题，并给出了算法。 - This text puts forward a very effective clipping algorithm based on line's slope, and compares it with Cyrus-Berk Algorithm.
本文提出了一种非常有效的基于直线斜率的凸多边形线裁剪算法，并与Cyrus-Berk算法进行了比较。 - In this paper, a new clipping algorithm for line segments with a rectangular window is presented and its correctness is proved.
本文提出了一种参数线段对矩形窗口裁剪的新算法，并且证明了算法的正确性。 - A Clipping Algorithm Based on Cross Product Method for Convex Polygon Window
基于叉积法的凸多边形窗口裁剪算法 - The clipping algorithm of2D arbitrary domain is improved to form the parametric boundary loops of the closed surfaces.
改进二维多边形区域的裁减算法，解决了闭合曲面在参数空间中的边界环形成问题。 - Clipping algorithm is an basic algorithm in the Computer Graphics and the base of a lot of important task.
裁剪算法是计算机图形学中的基本算法，也是其它诸多重要问题的基础。 - Research and implementation of polygon clipping algorithm
任意多边形裁剪算法的研究及其实现 - Clipping Algorithm and Practice of Circular Window
圆形窗口裁剪算法的研究与实践 - Based on profound study of various position relations between a line segment and a circle, a simple and rapid clipping algorithm for circular window is presented in this paper.
通过对直线段相对圆的各种位置关系作深入的研究，提出了一种简单而迅速的圆形窗口裁剪算法。 - Moreover, a repeated clipping and filtering method based on the previous clipping algorithm is discussed.
论文还讨论了一种在该双向FFT限幅算法基础上发展而来的重复限幅滤波算法，通过采用多次限幅、滤波操作，可以进一步提升降低PAPR的性能。 - Besides, this clipping algorithm adopts the single circular linked list to represent the polygon and intersection points, which reduces the complexity of the data structure.
该算法还采用了较为简单的单循环链表来存储多边形和交点，降低了数据结构的复杂性。 - This thesis then investigates a clipping algorithm which uses bidirectional FFT operation to filter in the frequency domain, and its PAPR reduction ability is simulated and analyzed under different Clipping Ratio ( RC).
本文随后研究了一种基于双向FFT实现频域滤波的限幅算法，仿真分析了在不同限幅率下降低PAPR的能力。 - For finite support kernel functions, a skeleton clipping algorithm is presented to compute the valid skeletons.
而对有限支撑核函数，给出了一种计算有效骨架的裁剪算法。 - Using S-H polygon clipping algorithm in computer graphics to calculate ship underwater and water plane geometry elements. Compared the calculation results with values which are given in the Loading Manual, suggesting its high precision and good generality.
引入计算机图形学中S-H多边形剪裁算法求取船舶水下几何要素及水线面几何要素，计算结果和装载手册中给定值比较，精确度高、通用性好。